class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length-1, ans = nums.length;
        while (left = right){
            int mid = ((right-left)  1) + left;
            if (target = nums[mid]) {
                ans = mid;
                right = mid-1;
            }else{
                left = mid+1;
            }
        }
        return ans;
    }
}